A PATTERN MATCHING ALGORITHM IN BINARY TREESKOJIMA K.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 147; PP. 99-114; BIBL. 7 REF.Conference Paper

A QUANTIZATION APPROXIMATION FOR MODELING COMPUTER NETWORK NODAL QUEUEING DELAYNIZNIK CA.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 245-253; BIBL. 42 REF.Article

A BINARY TREE REPRESENTATION AND RELATED ALGORITHMS FOR GENERATING INTEGER PARTITIONSFENNER TI; LOIZOU G.1980; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1980; VOL. 23; NO 4; PP. 332-337; BIBL. 15 REF.Article

A METHOD FOR THE DESIGN OF BINARY TREE CLASSIFIERSSHI QUING YUN.1981; CONFERENCE ON PATTERN RECOGNITION AND IMAGE PROCESSING/1981/DALLAS TX; USA; NEW YORK: IEEE; DA. 1981; PP. 21-26; BIBL. 11 REF.Conference Paper

GRAPHS THAT ARE ALMOST BINARY TREESHONG JW; ROSENBERG AL.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 227-242; BIBL. 12 REF.Article

GRAPHS THAT ARE ALMOST BINARY TREES. PRELIMINARY VERSIONHONG JW; ROSENBERG AL.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 334-341; BIBL. 12 REF.Conference Paper

AUTOMATIC CLASSIFICATION OF CERVICAL CELLS USING A BINARY TREE CLASSIFIERLIN YK; FU KS.1983; PATTERN RECOGNITION; ISSN 0031-3203; USA; DA. 1983; VOL. 16; NO 1; PP. 69-80; BIBL. 19 REF.Article

AN EXPLICIT EXPRESSION FOR THE COST OF A CLASS OF HUFFMAN TREESHWANG FK.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 32; NO 2; PP. 163-165; BIBL. 8 REF.Article

SOME RESULTS ON HU'S CONJECTURE CONCERNING BINARY TREESCHU YUNG CHING.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 29; NO 3; PP. 251-255; BIBL. 1 REF.Article

THE AVERAGE NUMBER OF REGISTERS NEEDED TO EVALUATE A BINARY TREE OPTIMALLYKEMP R.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 4; PP. 363-372; BIBL. 6 REF.Article

STACK SORTABLE PERMUTATIONSROTEM D.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 2; PP. 185-196; BIBL. 9 REF.Article

BINARY TREES AND PARALLEL SCHEDULING ALGORITHMSDEKEL E; SAHNI S.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 307-315; BIBL. 38 REF.Article

CLASSES OF FUNCTIONS OVER BINARY TREESBUENING HK.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 199-204; BIBL. 8 REF.Conference Paper

IMPLANTING FFP TREES IN BINARY TREES: AN ARCHITECTURAL PROPOSALTOLLE DM.1981; CONFERENCE ON FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE/1981/PORTSMOUTH NH; USA; NEW YORK: ACM; DA. 1981; PP. 115-122; BIBL. 3 REF.Conference Paper

A NOTE ON TRAVERSAL ALGORITHMS FOR TRIPLY LINKED BINARY TREESFENNER TI; LOIZOU G.1981; BIT (NORD-TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 2; PP. 153-156; BIBL. 7 REF.Article

APPLIED TREE ENUMERATIONSDERSHOWITZ N; ZAKS S.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 180-193; BIBL. 18 REF.Conference Paper

GENERATION OF K-ARY TREESCHUNG LAUNG LIU.1980; RAPP. RECH., I.N.R.I.A.; FRA; DA. 1980; NO 27; 25 P.; ABS. FRE; BIBL. 7 REF.Serial Issue

LEXICOGRAPHIC GENERATION OF ORDERED TREESZAKS S.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 63-82; BIBL. 20 REF.Article

ON THE AVERAGE NUMBER OF REBALANCING OPERATIONS IN WEIGHT-BALANCED TREESBLUM N; MEHLHORN K.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 3; PP. 303-320; BIBL. 10 REF.Article

A COMBINED NON PARAMETRIC APPROACH TO FEATURE SELECTION AND BINARY DECISION TREE DESIGNROUNDS EM.1980; PATTERN RECOGN.; ISSN 0031-3203; USA; DA. 1980; VOL. 12; NO 5; PP. 313-317; BIBL. 13 REF.Article

GENERATION OF BINARY TREES FROM BALLOT SEQUENCESROTEM D; VAROL YL.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 3; PP. 396-404; BIBL. 6 REF.Article

TREE STRUCTURES FOR HIGH DIMENSIONALITY NEAREST NEIGHBOR SEARCHINGEASTMAN CM; WEISS SF.1982; INFORMATION SYSTEMS; ISSN 0306-4379; GBR; DA. 1982; VOL. 7; NO 2; PP. 115-122; BIBL. 20 REF.Article

GENERATING K-ARY TREES IN LEXICOGRAPHIC ORDERZHU YONGJIN; WANG JIAN FANG.1980; SCI. SIN.; ISSN 0582-236X; CHN; DA. 1980; VOL. 23; NO 10; PP. 1119-1225; BIBL. 4 REF.Article

ON THE AREA OF BINARY TREE LAYOUTBRENT RP; KUNG HT.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 1; PP. 46-48; BIBL. 6 REF.Article

SYSTEMES ET LANGAGES: L'ALGORITHMIQUE, UN THEME CENTRAL DE L'INFORMATIQUEBANDERET P; NIEVERGELT J.1980; ZERO, UN, INFORMAT.; FRA; DA. 1980; NO 141; PP. 37-43; BIBL. 11 REF.Article